Universal groups for right-angled buildings
نویسندگان
چکیده
منابع مشابه
Lattices Acting on Right-angled Hyperbolic Buildings
Let X be a right-angled hyperbolic building. We show that the lattices in Aut(X) share many properties with tree lattices. For example, we characterise the set of covolumes of uniform and of nonuniform lattices in Aut(X), and show that the group Aut(X) admits an infinite ascending tower of uniform and of nonuniform lattices. These results are proved by constructing a functor from graphs of grou...
متن کاملBoundaries of Right-angled Hyperbolic Buildings *
We prove that the boundary of a right-angled hyperbolic building is a universal Menger space. Corollary: the 3-dimensional universal Menger space is the boundary of some Gromov-hyperbolic group. Mathematics Subject Classification (2000): 20E42, 54F35, 20F67
متن کاملLattices acting on right-angled buildings
Let X be a right-angled building. We show that the lattices in Aut(X) share many properties with tree lattices. For example, we characterise the set of covolumes of uniform and of nonuniform lattices in Aut(X), and show that the group Aut(X) admits an infinite ascending tower of uniform and of nonuniform lattices. These results are proved by constructing a functor from graphs of groups to compl...
متن کاملA Complex for Right-angled Coxeter Groups
We associate to each right-angled Coxeter group a 2-dimensional complex. Using this complex, we show that if the presentation graph of the group is planar, then the group has a subgroup of finite index which is a 3-manifold group (that is, the group is virtually a 3-manifold group). We also give an example of a right-angled Coxeter group which is not virtually a 3-manifold group.
متن کاملSurface Subgroups of Right-Angled Artin Groups
We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group A(K) has such a subgroup if its defining graph K contains an n-hole (i.e. an induced cycle of length n) with n ≥ 5. We construct another eight “forbidden” graphs and show that every graph K on ≤ 8 vertices either contains one of our examples, or co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2018
ISSN: 1661-7207
DOI: 10.4171/ggd/443